Constructing tree decompositions of graphs with bounded gonality
نویسندگان
چکیده
Abstract In this paper, we give a constructive proof of the fact that treewidth graph is at most its divisorial gonality. The gives polynomial time algorithm to construct tree decomposition width k , when an effective divisor degree reaches all vertices given. We also similar result for two related notions: stable gonality and
منابع مشابه
Constructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملRecoloring graphs via tree decompositions
Let k be an integer. Two vertex k-colorings of a graph are adjacent if they differ on exactly one vertex. A graph is k-mixing if any proper k-coloring can be transformed into any other through a sequence of adjacent proper k-colorings. Jerrum proved that any graph is k-mixing if k is at least the maximum degree plus two. We first improve Jerrum’s bound using the grundy number, which is the wors...
متن کاملTree decompositions and social graphs
Recent work has established that large informatics graphs such as social and information networks have a nontrivial treelike structure when viewed at moderate-size scales. Here, we present results from the first detailed empirical evaluation of the use of tree decomposition (TD) heuristics for structure identification and extraction in social graphs. Although TDs have historically been used in ...
متن کاملLayout of Graphs with Bounded Tree-Width
A queue layout of a graph consists of a total order of the vertices, and a partition of the edges into queues, such that no two edges in the same queue are nested. The minimum number of queues in a queue layout of a graph is its queue-number. A threedimensional (straight-line grid) drawing of a graph represents the vertices by points in Z and the edges by non-crossing line-segments. This paper ...
متن کاملClasses of graphs with small rank decompositions are X-bounded
A class of graphs G is χ-bounded if the chromatic number of graphs in G is bounded by a function of the clique number. We show that if a class G is χ-bounded, then every class of graphs admitting a decomposition along cuts of small rank to graphs from G is χ-bounded. As a corollary, we obtain that every class of graphs with bounded rank-width (or equivalently, clique-width) is χ-bounded.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Optimization
سال: 2021
ISSN: ['1573-2886', '1382-6905']
DOI: https://doi.org/10.1007/s10878-021-00762-w